Connectivity of addable graph classes
نویسندگان
چکیده
منابع مشابه
Connectivity of addable graph classes
A non-empty class A of labelled graphs is weakly addable if for each graph G ∈ A and any two distinct components of G, any graph that can be obtain by adding an edge between the two components is also in A. For a weakly addable graph class A, we consider a random element Rn chosen uniformly from the set of all graph in A on the vertex set {1, . . . , n}. McDiarmid, Steger and Welsh conjecture [...
متن کاملConnectivity of Addable Monotone Graph Classes ⋆
A class A of labelled graphs is weakly addable if if for all graphs G in A and all vertices u and v in distinct connected components of G, the graph obtained by adding an edge between u and v is also in A; the class A is monotone if for all G ∈ A and all subgraphs H of G, we have H ∈ A. We show that for any weakly addable, monotone class A whose elements have vertex set {1, . . . , n}, the prob...
متن کاملOn the connectivity of random graphs from addable classes
A class A of graphs is called weakly addable (or bridge-addable) if for any G ∈ A and any two distinct components C1 and C2 in G, any graph that can be obtained by adding an edge between C1 and C2 is also in A. McDiarmid, Steger and Welsh conjectured in [6] that a graph chosen uniformly at random among all graphs with n vertices in a weakly addable A is connected with probability at least e−1/2...
متن کاملConnectivity in bridge-addable graph classes: the McDiarmid-Steger-Welsh conjecture
A class of graphs is bridge-addable if given a graph G in the class, any graph obtained by adding an edge between two connected components of G is also in the class. We prove a conjecture of McDiarmid, Steger, and Welsh, that says that if Gn is any bridge-addable class of graphs on n vertices, and Gn is taken uniformly at random from Gn, then Gn is connected with probability at least e− 1 2 + o...
متن کاملLocal Convergence and Stability of Tight Bridge-Addable Graph Classes
A class of graphs is bridge-addable if given a graph G in the class, any graph obtained by adding an edge between two connected components of G is also in the class. The authors recently proved a conjecture of McDiarmid, Steger, and Welsh stating that if G is bridge-addable and Gn is a uniform n-vertex graph from G, then Gn is connected with probability at least (1 + o(1))e−1/2. The constant e−...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2008
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2007.09.003